A Linear - Time Algorithm That Locates

نویسندگان

  • Karen Villaverde
  • Vladik Kreinovich
چکیده

The problem of locating local maxima and minima of a function from approximate measurement results is vital for many physical applications: In spectral analysis, chemical species are identiied by locating local maxima of the spectra. In radioastronomy, sources of celestial radio emission, and their subcomponents, are identiied by locating local maxima of the measured brightness of the radio sky. Elementary particles are identiied by locating local maxima of the experimental curves. i = y i + ". The set F of all the functions f(x) that satisfy this property can be considered as a function interval (this deenition was, in essence, rst proposed by R. Moore). We say that an interval I locates a local maximum if all functions f 2 F attain a local maximum at some point from I. So, the problem is to generate intervals I 1 ; :::; I k that locate local maxima. Evidently, if I locates a local maximum, then any bigger interval J I also locates this maximum. We want to nd the smallest possible location I. We (Charlottesville, VA) for discussing possible astronomical applications, and to anonymous referees for important improvements. 1 propose an algorithm that nds the smallest possible locations in linear time (i.e., in time that is Cn for some C). 1 Why is This Problem Important for Applications The problem is really important. In many applications, the following problem arises: we know that a physical quantity y is a function of some other physical quantity x, y = f(x), and we want to know the local maxima of this function f. In spectral analysis, chemical species are identiied by locating local maxima of the spectra. In radioastronomy, sources of celestial radio emission and their subcompo-nents are identiied by locating local maxima of the measured brightness of the radio sky. In other words, we are interested in the local maxima of the brightness distribution, i.e., of the function y(x) that describes how the intensity y of the signal depends on the position x of the point from which we receive this signal. Elementary particles are identiied by locating local maxima of the experimental curves that describe (crudely speaking) the scattering intensity y as a function of energy x. Local maxima and minima are also used in the methods that accelerate the convergence of the measurement result to the real value of a physical variable, and thus allow the user to …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pii: S0925-7721(01)00044-x

We present two algorithms for packing two largest disks in a polygon. The first algorithm locates two disks in a simple polygon in time O(n log2 n) improving the best previous deterministic result (Bespamyatnikh, 1999) by a factor of logn. The second algorithm finds two disks in a convex polygon such that the disks are separated by a diagonal of the polygon. It runs in time O(n log2 n) improvin...

متن کامل

AN ALGORITHM FOR FINDING THE STABILITY OF LINEAR TIME-INVARIANT SYSTEMS

The purpose of this paper is to show that the ideas and techniques of the classical methods of finding stability, such as the criteria of Leonhard and Nyquist, can be used to derive simple algorithm to verify stability. This is enhanced by evaluating the argument of the characteristic equation of a linear system in the neighbourhood of the origin of the complex plane along the imaginary axis

متن کامل

Linear Sphericity Testing of 3-Connected Single Source Digraphs

It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.

متن کامل

GGMRES: A GMRES--type algorithm for solving singular linear equations with index one

In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...

متن کامل

Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993